Rogers-Ramanujan-Slater Type Identities

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finite Rogers-Ramanujan Type Identities

Polynomial generalizations of all 130 of the identities in Slater’s list of identities of the Rogers-Ramanujan type are presented. Furthermore, duality relationships among many of the identities are derived. Some of the these polynomial identities were previously known but many are new. The author has implemented much of the finitization process in a Maple package which is available for free do...

متن کامل

Combinatorics of Ramanujan-Slater Type Identities

We provide the missing member of a family of four q-series identities related to the modulus 36, the other members having been found by Ramanujan and Slater. We examine combinatorial implications of the identities in this family, and of some of the identities we considered in “Identities of the Ramanujan-Slater type related to the moduli 18 and 24,” [J. Math. Anal. Appl. 344/2 (2008) 765–777].

متن کامل

Rogers-ramanujan Type Identities for Alternating Knots

We highlight the role of q-series techniques in proving identities arising from knot theory. In particular, we prove Rogers-Ramanujan type identities for alternating knots as conjectured by Garoufalidis, Lê and Zagier.

متن کامل

Some Crystal Rogers-ramanujan Type Identities

Abstract. By using the KMN2 crystal base character formula for the basic A (1) 2 module, and the principally specialized Weyl-Kac character formula, we obtain a Rogers-Ramanujan type combinatorial identity for colored partitions. The difference conditions between parts are given by the energy function of certain perfect A (1) 2 crystal. We also recall some other identities for this type of colo...

متن کامل

New Finite Rogers-Ramanujan Identities

We present two general finite extensions for each of the two Rogers-Ramanujan identities. Of these one can be derived directly from Watson’s transformation formula by specialization or through Bailey’s method, the second similar formula can be proved either by using the first formula and the q-Gosper algorithm, or through the so-called Bailey lattice.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Combinatorics

سال: 2008

ISSN: 1077-8926

DOI: 10.37236/36